Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
نویسندگان
چکیده
Through the use of an effective simulated annealing algorithm, this paper presents an extensive computational investigation concerning the performance evaluation of non-permutation vs. permutation schedules for the flowline manufacturing cell with sequence dependent setup times. The results show that there are significant improvements made by using non-permutation schedules over permutation schedules regarding completion-time based and due-date based criteria. It is suggested that practitioners could adopt non-permutation schedules to improve their operational efficiency within a reasonable amount of computational effort.
منابع مشابه
Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
The broad applications of cellular manufacturing make flowline manufacturing cell scheduling problems with sequence dependent family setup times a core topic in the field of scheduling. Due to computational complexity, almost all published studies focus on using permutation schedules to deal with this problem. To explore the potential effectiveness of treating this argument using non-permutatio...
متن کاملGenerating non-permutation schedules in flowline-based manufacturing sytems with sequence-dependent setup times of jobs: a heuristic approach
A flowline-based manufacturing system is a manufacturing environment where machines are arranged in accordance with the order of processing of jobs, with all jobs having an identical and unidirectional flow pattern through the machines; however, some or all jobs may have missing operations on some machines. In several practical situations the setup times of jobs are separable, significant and s...
متن کاملRelax and Fix Heuristics for Simultaneous Lot Sizing and Sequencing the Permutation Flow Shops with Sequence-Dependent Setups
This paper proposes two relax and fix heuristics for the simultaneous lot sizing and sequencing problem in permutation flow shops involving sequence-dependent setups and capacity constraints. To evaluate the effectiveness of mentioned heuristics, two lower bounds are developed and compared against the optimal solution. The results of heuristics are compared with the selected lower bound .
متن کاملIntegrative Cooperative Approach for Solving Permutation Flowshop Scheduling Problem with Sequence Dependent Family Setup Times
This paper addresses to the permutation flowline manufacturing cell with sequence dependent family setup times problem. The objective is to minimize the makespan criterion. We propose a cooperative approach including a genetic algorithm and a branch and bound procedure. The latter is probabilistically integrated in the genetic algorithm in order to enhance the current solution. Moreover, the ap...
متن کاملA Multi-objective Immune System for a New Bi-objective Permutation Flowshop Problem with Sequence-dependent Setup Times
We present a new mathematical model for a permutation flowshop scheduling problem with sequence-dependent setup times considering minimization of two objectives, namely makespan and weighted mean total earliness/tardiness. Only small-sized problems with up to 20 jobs can be solved by the proposed integer programming approach. Thus, an effective multi-objective immune system (MOIS) is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010